New systolic array architecture for finite field division
نویسندگان
چکیده
منابع مشابه
Finite Field Arithmetic Architecture Based on Cellular Array
Finite field arithmetic operations, especially for the binary field GF(2 m ), have been widely used in the areas of data communication and network security applications such as errorcorrecting codes [1,2] and cryptosystems such as ECC(Elliptic Curve Cryptosystem) [3,4]. The finite field multiplication is the most frequently studied. This is because the timeconsuming operations such as exponenti...
متن کاملA systolic array architecture for the discrete sine transform
An efficient approach to design very large scale integration (VLSI) architectures and a scheme for the implementation of the discrete sine transform (DST), based on an appropriate decomposition method that uses circular correlations, is presented. The proposed design uses an efficient restructuring of the computation of the DST into two circular correlations, having similar structures and only ...
متن کاملTwo-dimensional systolic-array architecture for pixel-level vision tasks
This paper presents ongoing work on the design of a two-dimensional (2D) systolic array for image processing. This component is designed to operate on a multi-processor system-on-chip. In contrast with other 2D systolicarray architectures and many other hardware accelerators, we investigate the applicability of executing multiple tasks in a time-interleaved fashion on the Systolic Array (SA). T...
متن کاملVLSI Implementation of Discrete Wavelet Transform using Systolic Array Architecture
The wavelet transform has itself a useful tool in the field of 1-dimensional and 2-dimensional signal compression systems. Due to the growing importance of this technique, there is an increasing need in many working groups for having a development environment which could be flexible enough and where the performance of a specific architecture could be measured, closer to reality rather than in a...
متن کاملSystolic and Super-Systolic Multipliers for Finite Field GF(2m) Based on Irreducible Trinomials
Novel systolic and super-systolic architectures are presented for polynomial basis multiplication over GF (2) based on irreducible trinomials. By suitable cut-set retiming, we have derived here an efficient bit-level-pipelined bit-parallel systolic design for binary field multiplication which requires less number of gates and registers, and involves nearly half the timecomplexity of the corresp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2018
ISSN: 1349-2543
DOI: 10.1587/elex.15.20180255